#include <iostream>
#include <algorithm>
#include <math.h>

using namespace std;

long long a[200005],flag[200005],n=0,ans;

int finds(long long x){
    long long l=x;
    while(a[l]==a[x]||flag[l]==1&&l<=n){
        ++l;
    }
    return l;
}

int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    ans=n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    for(int i=0;i<n-1;i++){
        int where=finds(i);
        flag[where]=1;
        if(where<n) ans-=1;
    }
    cout<<ans;
    return 0;
}
